Forcing by non-scattered sets

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Forcing with Ideals Generated by Closed Sets

Consider the posets PI = Borel(R) \ I where I is a σ-ideal σ-generated by a projective collection of closed sets. Then the PI extension is given by a single real r of an almost minimal degree: every real s ∈ V [r] is Cohen-generic over V or

متن کامل

Scattered Linear Sets and Pseudoreguli

In this paper, we show that one can associate a pseudoregulus with every scattered linear set of rank 3n in PG(2n − 1, q3). We construct a scattered linear set having a given pseudoregulus as associated pseudoregulus and prove that there are q − 1 different scattered linear sets that have the same associated pseudoregulus. Finally, we give a characterisation of reguli and pseudoreguli in PG(3, ...

متن کامل

Radius-forcing sets in graphs

Let G be a connected graph of order p and let 0 ::f. s ~ V ( G). Then S is a rad(G)-forcing set (or a radius-forcing set of G) if, for each v E V(G), there exists v' E S with dc(v, v') ?: rad(G). The cardinality of a smallest radius-forcing set of G is called the radius-forcing number of G and is denoted by rf(G). A graph G is called a randomly k-forcing graph for a positive integer k if every ...

متن کامل

Minimum Forcing Sets for Miura Folding Patterns

We introduce the study of forcing sets in mathematical origami. The origami material folds flat along straight line segments called creases, each of which is assigned a folding direction of mountain or valley. A subset F of creases is forcing if the global folding mountain/valley assignment can be deduced from its restriction to F . In this paper we focus on one particular class of foldable pat...

متن کامل

Rudimentary recursion, provident sets and forcing

and call a set A provident if it is transitive and closed under all p-rud-rec functions with p a member of A. * If ζ is the least ordinal not in a provident set A, then ζ is indecomposable, that is, that the sum of two ordinals less than ζ is less than ζ. Conversely, if ζ is indecomposable, η > ζ and p ∈ Jζ , then the Jensen set Jη is is closed under all p-rud rec functions; in particular Jζ is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Pure and Applied Logic

سال: 2012

ISSN: 0168-0072

DOI: 10.1016/j.apal.2012.02.004